Knowledge-Enriched Route Computation

نویسندگان

  • Georgios Skoumas
  • Klaus Arthur Schmid
  • Gregor Jossé
  • Matthias Schubert
  • Mario A. Nascimento
  • Andreas Züfle
  • Matthias Renz
  • Dieter Pfoser
چکیده

Directions and paths, as commonly provided by navigation systems, are usually derived considering absolute metrics, e.g., finding the shortest or the fastest path within an underlying road network. With the aid of Volunteered Geographic Information (VGI), i.e., geo-spatial information contained in user generated content, we aim at obtaining paths that do not only minimize distance but also lead through more popular areas. Based on the importance of landmarks in Geographic Information Science and in human cognition, we extract a certain kind of VGI, namely spatial relations that define closeness (nearby, next to) between pairs of points of interest (POIs), and quantify them following a probabilistic framework. Subsequently, using Bayesian inference we obtain a crowd-based closeness confidence score between pairs of PoIs. We apply this measure to the corresponding road network based on an altered cost function which does not exclusively rely on distance but also takes crowdsourced geo-spatial information into account. Finally, we propose two routing algorithms on the enriched road network. To evaluate our approach, we use Flickr photo data as a ground truth for popularity. Our experimental results – based on real world datasets – show that the paths computed w.r.t. our alternative cost function yield competitive solutions in terms of path length while also providing more “popular” paths, making routing easier and more informative for the user.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING

Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

متن کامل

Parallel computation framework for optimizing trailer routes in bulk transportation

We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...

متن کامل

Intelligent Route Finding: Combining Knowledge and Cases and an Efficient Search Algorithm

One of the major road transportation problems is route finding. With the massive and complicated road network of a modern city (or country), finding a good route to travel from one place to another is not a simple task. In Network Theory, this is a shortest path problem. Shortest path algorithms are often used to solve the problem. However, these algorithms are wasteful in terms of computation ...

متن کامل

Development of Landmark Knowledge at Decision Points

Two experiments investigated how people develop different landmark knowledge at decision points. Participants learned a route in a virtual city once or five times. One distinctive landmark was placed at each intersection of the route. At test, participants were released at each intersection according to the learning order and were required to determine the turning direction. At each intersectio...

متن کامل

Elaborate Descriptive Information in Indoor Route Instructions

The following paper presents the enhancement of indoor route instructions with descriptive generation strategies. We consider the latter to be highly important for the quality and helpfulness of automatically generated indoor route instructions. We conducted an experiment showing that participants receiving route instructions enriched with elaborate descriptive information instead of step-by-st...

متن کامل

Using Knowledge to Isolate Search in Route Finding

Traveling is a part of every person's day-to-day life. With the massive and complicated road network of a modern city (or country), finding a good route to travel from one place to another is not a simple task. In Network Theory, this is the shortest path problem. Shortest path algorithms are often used to solve the problem. However, these algorithms are wasteful in terms of computation when ap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015